Average Consensus in the Presence of Delays in Directed Graph Topologies

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Average Consensus in the Presence of Dynamically Changing Directed Graph Topologies and Time Delays

We have recently proposed a robustified ratio consensus algorithm which achieves asymptotic convergence to the global average in a distributed fashion in static strongly connected digraphs, despite the possible presence of bounded but otherwise arbitrary delays. In this work, we propose a protocol which reaches asymptotic convergence to the global average in a distributed fashion under possible...

متن کامل

Average Consensus in the Presence of Delays and Dynamically Changing Directed Graph Topologies

Classical approaches for asymptotic convergence to the global average in a distributed fashion typically assume timely and reliable exchange of information between neighboring components of a given multi-component system. These assumptions are not necessarily valid in practical settings due to varying delays that might affect transmissions at different times, as well as possible changes in the ...

متن کامل

Consensus on the average in arbitrary directed network topologies with time-delays

In this preliminary paper we study the stability property of a consensus on the average algorithm in arbitrary directed graphs with respect to communication/sensing timedelays. The proposed algorithm adds a storage variable to the agents’ states so that the information about the average of the states is preserved despite the algorithm iterations are performed in an arbitrary strongly connected ...

متن کامل

Broadcast and Gossip Stochastic Average Consensus Algorithms in Directed Topologies

We address the problem of a set of agents reaching consensus by computing the average of their initial states. We propose two randomized algorithms over a directed communication graph where either a random node broadcast its value or a randomly selected pair of nodes communicate in a distributed fashion. The proposed algorithms guarantee convergence in three important definitions, namely: almos...

متن کامل

On Average Consensus over Stochastically Switching Directed Topologies

Average consensus is a canonical problem in wireless sensor networks. Wireless communication channels exhibit stochastic data loss due to multiple reasons including fading and interference. This note considers average consensus algorithms executed over communication topologies that vary probabilistically due to such effects. It is known that even in this case the state values will reach consens...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Automatic Control

سال: 2014

ISSN: 0018-9286,1558-2523

DOI: 10.1109/tac.2013.2275669